#include <iostream>
#include "BinarySearchTree.h"

int main() {
    int arr1[] = {99,87,67,57,35,86,45,477};
    lwj::BST<int> bst;
    for(auto e : arr1) bst.insert(e);
    lwj::BST<int> bst2(bst);
    bst.InOrder();
    for(auto e : arr1)
    {
        bst2.erase(e);
        bst2.InOrder();
    }
    return 0;
}
